The Optimal Use of Government Purchases for Macroeconomic Stabilization Pascal Michaillat (LSE) & Emmanuel Saez (Berkeley) August 2015

Source URL: eml.berkeley.edu

• Logic
• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution
• Labour economics
• Macroeconomics
• National savings

First-Order Mixed Integer Linear Programming Geoffrey J. Gordon Machine Learning Department Carnegie Mellon University Pittsburgh, PA 15213

Source URL: select.cs.cmu.edu

• Logic
• Mathematical logic
• Abstraction
• Automated theorem proving
• Model theory
• Predicate logic
• Semantics
• Boolean algebra
• Resolution
• Cutting-plane method
• First-order logic
• Propositional calculus

Under consideration for publication in Math. Struct. in Comp. Science Formalization of Real Analysis: A Survey of Proof Assistants and Libraries∗ SYLVIE BOLDO CATHERINE LELAY

Source URL: www.lri.fr

• Proof assistants
• Real numbers
• Automated theorem proving
• Elementary mathematics
• Type theory
• First-order logic
• Construction of the real numbers
• Constructivism
• Mathematical logic
• Isabelle
• Axiom
• Setoid

Automated Theorem Proving Peter Baumgartner http://users.rsise.anu.edu.au/˜baumgart/ Slides partially based on material by Alexander Fuchs, Harald Ganzinger, John Slaney, Viorica Sofronie-

Source URL: ssll.cecs.anu.edu.au

THE COMPLEXITY OF SATISFACTION PROBLEMS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of

Source URL: ludovicpatey.com

• Automated theorem proving
• Logic programming
• Logic in computer science
• Boolean algebra
• Model theory
• Substitution
• Boolean satisfiability problem
• Interpretation
• Relationships among probability distributions
• Lifting theory

MM Research Preprints, 172–180 MMRC, AMSS, Academia, Sinica, Beijing No. 21, December 2002 Automated Theorem Proving in the Homogeneous Model with Clifford Bracket Algebra

Source URL: www.mmrc.iss.ac.cn

Nunchaku: Flexible Model Finding for Higher-Order Logic Simon Cruanes, Jasmin Blanchette, Andrew Reynolds Veridis, Inria Nancy https://cedeela.fr/~simon/ April 7th, 2016

Source URL: cedeela.fr

• Logic
• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution

Analyzing proofs in analysis∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe–Universit¨at Robert–Mayer–Str. 6–10, D–60054 Frankfurt am Main, Germany 1

Source URL: www.mathematik.tu-darmstadt.de

• Logic
• Mathematics
• Mathematical analysis
• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution
• Computability theory
• operator
• Spectral theory of ordinary differential equations

Archive for Mathematical Logic manuscript No. (will be inserted by the editor) Elimination of Skolem functions for monotone formulas in analysis Ulrich Kohlenbach

Source URL: www.mathematik.tu-darmstadt.de

• Logic
• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution
• Symbol
• Constructible universe

Human-Oriented Proof Techniques are Relevant for Proof Tutoring (Extended Abstract) Marvin Schiller and Christoph Benzm¨uller Saarland University, Germany and Articulate Software, USA Automated theorem proving technique

Source URL: www.marvin-schiller.de